A Review of Rules Family of Algorithms

نویسندگان

  • Mehmet Sabih Aksoy
  • M. S. Aksoy
چکیده

In recent years, there has been a growing amount of research on inductive learning. Out of this research a number of promising algorithms have surfaced. In the paper after a brief description of knowledge acquisition, induction and inductive learning; RULES family of inductive learning algorithms, their strengths as well as weaknesses are explained and discussed. The applications of inductive learning and particularly the applications of RULES family of algorithms are overviewed. Key wordsInduction, Inductive Learning, Knowledge Acquisition, Expert Systems 1. KNOWLEDGE ACQUISITION Knowledge-based expert systems consist of two main components: a knowledge base and an inference mechanism. Collecting knowledge to form the knowledge base is the main task in the process of building an expert system [1,2,3]. The process of acquiring knowledge through interaction with an expert consists of a prolonged series of intense, systematic interviews, usually extending over a long period [4]. Human experts are capable of using their knowledge in their daily work, but they usually cannot summarize and generalize their knowledge explicitly in a form which is sufficiently systematic, correct and complete for machine representation and application [1]. Expert systems require large amounts of knowledge to achieve high levels of performance, yet the acquisition of knowledge is slow and expensive [5]. The shortage of trained knowledge engineers to interview experts and capture their knowledge is another problem of knowledge acquisition [6]. The aforementioned problems are not just difficulties of the early days of the technology, but are still acknowledged today as paramount problems. Knowledge acquisition (and in particular machine learning) has become a major area of concern for expert systems research [5,7]. An alternative method of knowledge acquisition exists in which knowledge is learned, or induced, from examples. While it is very difficult for an expert to articulate his knowledge, it is relatively easy to document case studies of the expert's skills at work [5]. Instead of asking an expert to summarize and articulate his knowledge, the main idea of automatic induction is to have him provide a basic structure of his discipline. The knowledge itself will be induced from examples expressed in this structure. Recent developments have proved that this method of knowledge acquisition is entirely possible. Indeed, the main feature of the second generation expert systems is that the knowledge acquisition process is highly automated [8].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

متن کامل

Different Methods of Long-Term Electric Load Demand Forecasting a Comprehensive Review

Long-term demand forecasting presents the first step in planning and developing future generation, transmission and distribution facilities. One of the primary tasks of an electric utility accurately predicts load demand requirements at all times, especially for long-term. Based on the outcome of such forecasts, utilities coordinate their resources to meet the forecasted demand using a least-co...

متن کامل

Introducing an algorithm for use to hide sensitive association rules through perturb technique

Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...

متن کامل

Solving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms

Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called  $lambda$–fuzzy measures. In this paper, we study a nonlinear optimization problem where the fea...

متن کامل

استفاده از الگوریتم های داده کاوی در بررسی عوامل موثر بر پیش بینی وضعیت بدو تولد نوزادان

Background & Objective: Prediction of health status in newborns and also identification of its affecting factors is of the utmost importance. There are different ways of prediction. In this study, effective models and patterns have been studied using decision tree algorithm. Method: This study was conducted on 1,668 childbirths in three hospitals of Shohada, Omidi and Mehr in city of Behshahr...

متن کامل

A Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms

In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008